Function Domains in Variable-Free Semantics

نویسنده

  • Alexis Dimitriadis
چکیده

Sauerland (1999) used such examples as the basis of an argument in favor of the traditional representation of pronouns as indexed variables, and against Jacobson’s Variable Free Semantics (VFS). In her response, Jacobson defends the VFS framework and argues that it can account for a broader range of examples than Sauerland’s proposal. In particular, Jacobson proposes that we can account for such examples by representing pronouns as restricted functions, and appealing to the contrastibility of their domains. Finally, Sauerland (2000) abandons the alphabetic variants proposal as unworkable and proposes an account which involves the translation of the stressed pronouns as covert definites (E-type pronouns). In the present paper I consider some issues connected with the incorporation of function domains into the Variable-Free Semantics framework. I show that although there is no technical obstacle to introducing function domains, for technical and empirical reasons they should not be used to account for the contrastive stress data. After a short introduction to Variable Free Semantics, I review Sauerland’s (1999) argument against VFS and Jacobson’s counter-proposal. Section 4 discusses the use of domains in VFS, and their application to the contrastive stress problem. Section 5 compares the domains required for evaluation with the notion of domains assumed by the domains analysis. Finally, section 6 argues that contrast cannot be predicted by simply comparing semantic translations, and discusses some tentative suggestions for a suitable account.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Implementation of an Extended Semantics for Logic Programs with Annotated Disjunctions

Logic Programming with Annotated Disjunctions (LPADs) is a formalism for modeling probabilistic information that has recently received increased attention. The LPAD semantics, while being simple and clear, suffers from the requirement of having function free-programs, which is a strong limitation. In this paper we present an extension of the semantics that removes this restriction and allows us...

متن کامل

An Extended Semantics for Logic Programs with Annotated Disjunctions and its Efficient Implementation

Logic Programming with Annotated Disjunctions (LPADs) is a formalism for modeling probabilistic information that has recently received increased attention. The LPAD semantics, while being simple and clear, suffers from the requirement of having function free-programs, which is a strong limitation. In this paper we present an extension of the semantics that removes this restriction and allows us...

متن کامل

Variable-free Semantics for Stochastic Processes: A Preliminary Report

There has been much early work on variable-free semantics and I will not attempt to review that here, but only mention the important systematic recent work of Tarski and Givant [7]. As is familiar to many people, Tarski and Givant show that a variable-free formalization of set theory can express a large part of standard mathematics, a lnuch larger part than almost anybody would expect to be the...

متن کامل

MHD FREE CONVECTIVE FLUCTUATING FLOW THROUGH A POROUS EFFECT WITH VARIABLE PERMEABILITY PARAMETER

In the present paper, we have studied MHD free convective two dimensional unsteady viscous incompressible flows through a porous effect bounded by an infinite vertical porous plate with constant suction. The permeability of the porous medium fluctuates in time about a constant mean, and the viscosity of fluid is assumed to vary as a linear function of temperature. The flow is permitted under th...

متن کامل

The complexity of primal logic with disjunction

We investigate the complexity of primal logic with disjunction according to the Kripke semantics as defined in [1] and the quasi-boolean semantics as defined in [2]. We show that the validity problem is coNP-complete, even for variable-free sequents. For quasi-boolean semantics, the satisfiability problem is shown to be NPcomplete (even for variable-free sequents), whereas for Kripke semantics ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001